翻訳と辞書 Words near each other ・ Relative growth rate ・ Relative Heroes ・ Relative homology ・ Relative humidity ・ Relative identifier ・ Relative income hypothesis ・ Relative index of inequality ・ Relative Insight ・ Relative intensity noise ・ Relative interior ・ Relative key ・ Relative locality ・ Relative luminance ・ Relative market share ・ Relative Merits ・ Relative neighborhood graph ・ Relative nonlinearity ・ Relative Optical Density Image Analysis ・ Relative outcomes of parenting by biological and adoptive parents ・ Relative permeability ・ Relative permittivity ・ Relative pitch ・ Relative price ・ Relative pronoun ・ Relative purchasing power parity ・ Relative rate test ・ Relative Record Data Set ・ Relative return ・ Relative risk ・ Relative risk reduction Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Relative neighborhood graph ： ウィキペディア英語版 Relative neighborhood graph In computational geometry, the relative neighborhood graph (RNG) is an undirected graph defined on a set of points in the Euclidean plane by connecting two points ''p'' and ''q'' by an edge whenever there does not exist a third point ''r'' that is closer to both ''p'' and ''q'' than they are to each other. This graph was proposed by Godfried Toussaint in 1980 as a way of defining a structure from a set of points that would match human perceptions of the shape of the set.〔.〕〔.〕 ==Algorithms== showed how to construct the relative neighborhood graph efficiently in O(''n'' log ''n'') time.〔.〕 It can be computed in O (''n'') expected time, for random set of points distributed uniformly in the unit square.〔.〕 The relative neighborhood graph can be computed in linear time from the Delaunay triangulation of the point set.〔.〕〔.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Relative neighborhood graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.